Weighted scale-free networks with stochastic weight assignments
نویسندگان
چکیده
منابع مشابه
Weighted scale-free networks with stochastic weight assignments.
We propose a model of weighted scale-free networks incorporating a stochastic scheme for weight assignments to the links, taking into account both the popularity and fitness of a node. As the network grows, the weights of links are driven either by the connectivity with probability p or by the fitness with probability 1-p. Numerical results show that the total weight exhibits a power-law distri...
متن کاملMinimum weight spanning trees of weighted scale free networks
In this lecture we will consider the minimum weight spanning tree (MST) problem, i.e., one of the simplest and most vital combinatorial optimization problems. We will discuss a particular greedy algorithm that allows to compute a MST for undirected weighted graphs, namely Kruskal’s algorithm, and we will study the structure of MSTs obtained for weighted scale free random graphs. This is meant t...
متن کاملCollective stochastic coherence and synchronizability in weighted scale-free networks
Coupling frequently enhances noise-induced coherence and synchronization in interacting nonlinear systems, but it does so separately. In principle collective stochastic coherence and synchronizability are incompatible phenomena, since strongly synchronized elements behave identically and thus their response to noise is indistinguishable to that of a single element. Therefore one can expect syst...
متن کاملScale-free networks with self-growing weight
We present a novel type of weighted scale-free network model, in which the weight grows independently of the attachment of new nodes. The evolution of this network is thus determined not only by the preferential attachment of new nodes to existing nodes but also by self-growing weight of existing links based on a simple weight-driven rule. This model is analytically tractable, so that the vario...
متن کاملSpectra of weighted scale-free networks
Much information about the structure and dynamics of a network is encoded in the eigenvalues of its transition matrix. In this paper, we present a first study on the transition matrix of a family of weight driven networks, whose degree, strength, and edge weight obey power-law distributions, as observed in diverse real networks. We analytically obtain all the eigenvalues, as well as their multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2003
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.67.040102